array code meaning in Chinese
阵码
Examples
- An improved error - correcting decoding algorithm for a class of mds array codes
阵列码的改进纠错译码算法 - This paper researches on the fast algorithm of hamilton array codes for high dimension and big hamming distance and key schedule algorithm based on hamilton array codes
本文主要针对快速高维大码距hamilton阵列编码的构造算法及其在分组密码的密钥编排算法中的应用进行了研究。 - Lastly , we design a key schedule algorithm helped by lfsr and hamilton array codes . the innovation of the thesis is given bellow : first : construct and program the fast algorithm of hamilton array codes for high dimension and big hamming distance
本文的创新之处有： 1 、构造和实现了快速高维大码距hamilton的阵列编码构造算法； 2 、提出了一个基于lfsr和hamilton阵列编码的通用密钥编排算法。 - The first kind of algorithm is based on s - box controlled by key , the algorithm distinguishes most of other block ciphers , its visible quality is that its s - box is not regular and fixative , but controlled by block cipher ' s key . the second kind of algorithm is based on smn ( d ) array code , it makes full use of the visible quality of smn ( d ) array code possessing big code distance ( d ) . the thesis discusses the two algorithms " reversibility , security and their qualities , the
第一种是基于“ s -盒由密钥控制”的变结构分组密码，该算法区别于其它大部分分组密码最大的特点是它的s -盒不是固定不变的而是由密钥控制产生；第二种是基于smn ( d )阵列编码的变结构分组密码，该算法充分利用了smn ( d )阵列编码具有码距大的特点；文中对这两个算法的可逆性、安全性及其性能等进行了探讨和分析，分析结果认为这两个变结构算法正确、有效且安全。 - Main contributions of this thesis are as follows : firstly , describe the theory of the hamilton array codes and its general construction . secondly , we construct and program the fast algorithm of hamilton array codes for high dimension and big hamming distance . thirdly , we discussion the design principle of the symmetry ciphers
内容包括：首先论述了hamilton阵列编码的理论和常规构造方法；然后，构造和实现了快速高维大码距hamilton的阵列编码构造算法；接着，探讨了对称密码（包括分组密码和序列密码）的设计原理，最后，结合lfsr和hamilton阵列产生通用密钥编排算法。